A novel maximum likelihood decoding algorithm for orthogonal space-time block codes

On"A Novel Maximum Likelihood Decoding Algorithm for Orthogonal Space-Time Block Codes"

Abstract The computational complexity of the Maximum Likelihood decoding algorithm in [1], [2] for orthogonal space-time block codes is smaller than specified.

A Novel Maximum Likelihood Detection Algorithm for Orthogonal Space-Time Block Codes

In this letter, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal space-time block codes (OSTBCs) based on the real-valued lattice representation and QR decomposition. We show that for a system with rate r = K/T , where K is the number of transmitted symbols per T time slots, the proposed algorithm decomposes the original complex-valued system into a parallel...

Space-time block codes with low maximum-likelihood decoding complexity

On the relaxed maximum-likelihood blind MIMO channel estimation for orthogonal space-time block codes

This paper concerns the maximum-likelihood channel estimation for MIMO systems with orthogonal space-time block codes when the finite alphabet constraint of the signal constellation is relaxed. We study the estimation subspace for the channel coefficients that this approach generates. We provide an algebraic characterisation of this subspace which turns the optimization problem into a purely al...

Orthogonal Space-Time Block Codes

in this paper, we provide a blind adaptive channel estimation method for decoding of orthogonal space-time block codes (OSTBC), which is built on the minimizing of an unconstrained cost function. The global minima of the cost function are analyzed. Both LMS and RLS algorithm realizations are given. Our method can adaptively track the time varying channel and decode transferred symbols without p...